Fast parametric reciprocal-orthogonal jacket transforms
نویسندگان
چکیده
منابع مشابه
Fast parametric reciprocal-orthogonal jacket transforms
In this paper, we propose a new construction method for a novel class of parametric reciprocal-orthogonal jacket transform (PROJT) having 4N parameters for a sequence length N = 2r+1 that is a power of two, based on the reciprocal-orthogonal parametric (ROP) transform and block diagonal matrices. It is shown that the inverse transform of the proposed PROJT is conveniently obtained by the recipr...
متن کاملArbitrary-Length Walsh-Jacket Transforms
Due to the efficiency in implementation, the Walsh (Hadamard) transform plays an important role in signal analysis and communication. Recently, Lee generalized the Walsh transform into the Jacket transform. Since the entries of the Jacket transform can be ±2, it is more flexible than the Walsh transform. Both the Walsh transform and the Jacket transform are defined for the case where the length...
متن کاملFast Algorithms for Orthogonal and Biorthogonal Modulated Lapped Transforms
New algorithms for the computation of orthogonal and biorthogonal modulated lapped transforms (MLTs) are presented. The new structures are obtained by combining the MLT window operators with stages from a recently introduced structure for the type-IV discrete cosine transform (DCT-IV). The net result is fewer multiplications and additions than previously reported algorithms. For the orthogonal ...
متن کاملNumerical stability of fast trigonometric and orthogonal wavelet transforms
Fast trigonometric transforms and periodic orthogonal wavelet transforms are essential tools for numerous practical applications. It is very important that fast algorithms work stable in a floating point arithmetic. This survey paper presents recent results on the worst case analysis of roundoff errors occurring in floating point computation of fast Fourier transforms, fast cosine transforms, a...
متن کاملFast orthogonal transforms and generation of Brownian paths
We present a number of fast constructions of discrete Brownian paths that can be used as alternatives to principal component analysis and Brownian bridge for stratified Monte Carlo and quasi-Monte Carlo. By fast we mean that a path of length [Formula: see text] can be generated in [Formula: see text] floating point operations. We highlight some of the connections between the different construct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2014
ISSN: 1687-6180
DOI: 10.1186/1687-6180-2014-149